A krakkói Computational Stylistics Group bemutatkozása
نویسندگان
چکیده
منابع مشابه
Computational Stylistics using Artificial Neural Networks
Previous work in using Artificial Neural Networks for computational stylistics has concentrated on using large, arbitrary network structures. This paper examines the use of the Cascade-Correlation algorithm for the construction of minimal networks. We find that a number of problems in computational stylistics with a large number of variables, but a limited number of training examples may be sol...
متن کاملLEXICALIZING COMPUTATIONAL STYLISTICS For Language Learner Feedback
Computational stylistics refers informally to a collection of tasks within computational linguistics that deal with the style—as opposed to the semantic content—of natural language. The most famous of these tasks is perhaps authorship attribution (Stamatatos et al., 2001), which uses statistical variations in word choice to select the most likely from a fixed set of potential authors. Though ap...
متن کاملAn automaton group: a computational case study
We introduce a two generated weakly branch contracting automaton group $G$ which is generated by a two state automaton on a three letter alphabet. Using its branch structure and the finiteness nature of a sequence of its factor groups we compute the order of some of these factors. Furthermore some algebraic properties of $G$ are detected .
متن کاملTaxonomy and Evaluation of Markers for Computational Stylistics
Currently, stylistic analysis of natural language texts is achieved through a wide variety of techniques containing many different algorithms, feature sets and collection methods. Most machine-learning methods rely on feature extraction to model the text and perform classification. But what are the best features for making style based distinctions? While many researchers have developed particul...
متن کاملan automaton group: a computational case study
we introduce a two generated weakly branch contracting automaton group $g$ which is generated by a two state automaton on a three letter alphabet. using its branch structure and the finiteness nature of a sequence of its factor groups we compute the order of some of these factors. furthermore some algebraic properties of $g$ are detected .
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Digitális bölcsészet
سال: 2021
ISSN: ['2630-9696']
DOI: https://doi.org/10.31400/dh-hun.2021.5.3147